Access structures determined by uniform polymatroids
نویسندگان
چکیده
Abstract In this article, all multipartite access structures obtained from uniform integer polymatroids were investigated using the method developed by Farràs, Martí-Farré, and Padró. They are matroid ports, i.e., they satisfy necessary condition to be ideal. Moreover, each polymatroid defines some ideal structures. Some objects in family can useful for applications of secret sharing. The presented article is universal continued with other classes further similar studies. Here, we especially interested hierarchy participants determined structure, distinguish two main classes: compartmented hierarchical results a monotone increasing Δ \Delta summarized as follows. If increment sequence non-constant, then structure connected. does not contain any singletons or height maximal its constant starting second element, compartmented. generated singleton hierarchical. proven ideal, their orders completely determined. if ∣ > 1 | \gt 1 , order antisymmetric, different blocks equivalent. always flat, that is, every chain has at most elements.
منابع مشابه
Banach Spaces Determined by Their Uniform Structures
Following results of Bourgain and Gorelik we show that the spaces lp, 1 < p < ∞, as well as some related spaces have the following uniqueness property: If X is a Banach space uniformly homeomorphic to one of these spaces then it is linearly isomorphic to the same space. We also prove that if a C(K) space is uniformly homeomorphic to c0, then it is isomorphic to c0. We show also that there are B...
متن کاملCellular Structures Determined by Polygons and Trees
The polytope structure of the associahedron is decomposed into two categories, types and classes. The classification of types is related to integer partitions, whereas the classes present a new combinatorial problem. We solve this, generalizing the work of [25], and incorporate the results into properties of the moduli space Mn 0 (R) studied in [8]. Connections are discussed with relation to cl...
متن کاملDiscrete Polymatroids
The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960’s and in early 1970’s, in the present paper the combinatorics and algebra on discrete polymatroids will be studied.
متن کاملValuative invariants for polymatroids
Many important invariants for matroids and polymatroids, such as the Tutte polynomial, the Billera-JiaReiner quasi-symmetric function, and the invariant G introduced by the first author, are valuative. In this paper we construct the Z-modules of all Z-valued valuative functions for labeled matroids and polymatroids on a fixed ground set, and their unlabeled counterparts, the Z-modules of valuat...
متن کاملUniform access to NoSQL systems
Non-relational databases (often termed as NoSQL) have recently emerged and have generated both interest and criticism. Interest because they address requirements that are very important in large-scale applications, criticism because of the comparison with well known relational achievements. One of the major problems often mentioned is the heterogeneity of the languages and of the interfaces the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2023
ISSN: ['1862-2984', '1862-2976']
DOI: https://doi.org/10.1515/jmc-2022-0017